Covering by squares
نویسندگان
چکیده
In this paper we introduce the “do not touch” condition for squares in the discrete plane. We say that two squares “do not touch” if they do not share any vertex or any segment of an edge. Using this condition we define a covering of the discrete plane, the covering can be strong or weak, regular or non-regular. For simplicity, in this article, we will restrict our attention to regular coverings, i.e., only a size is allowed for the squares and all the squares have the same number of adjacent squares. We establish minimal conditions for the existence of a weak or strong regular covering of the discrete plane, and we give a bound for the number of adjacent squares with respect to the size of the squares in the regular covering. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Approximation Algorithms for Geometric Covering Problems for Disks and Squares
Geometric covering is a well-studied topic in computational geometry. We study three covering problems: Disjoint Unit-Disk Cover, Depth-(≤ K) Packing and Red-Blue UnitSquare Cover. In the Disjoint Unit-Disk Cover problem, we are given a point set and want to cover the maximum number of points using disjoint unit disks. We prove that the problem is NP-complete and give a polynomial-time approxim...
متن کاملA linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
This paper discusses the problem of covering and hitting a set of line segments L in R by a pair of axis-parallel squares such that the side length of the larger of the two squares is minimized. We also discuss the restricted version of covering, where each line segment in L is to be covered completely by at least one square. The proposed algorithm for the covering problem reports the optimum r...
متن کاملCovering Segments with Unit Squares
We study several variations of line segment covering problem with axis-parallel unit squares in IR. A set S of n line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give...
متن کاملHeuristic Approaches to the capacitated Square Covering Problem
We consider the capacitated square covering problem (CSCP), which is described as follows. Given a set of points, each having a demand, in the two-dimensional Euclidean plane, we find the minimum number of squares with the same size and capacity to cover all the points under the capacity constraint. As CSCP is NP-hard, we focus on heuristic algorithms in this paper. We first test a set covering...
متن کاملOn the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities
The Lasserre/Sum-of-Squares hierarchy is a systematic procedure to strengthen LP relaxations by constructing a sequence of increasingly tight formulations. For a wide variety of optimization problems, this approach captures the convex relaxations used in the best available approximation algorithms. The capacitated covering IP is an integer program of the form min{cx : Ux ≥ d, 0 ≤ x ≤ b, x ∈ Z+}...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 396 شماره
صفحات -
تاریخ انتشار 2008